Admission Control in Priority Queueing System With Servers Reservation and Temporal Blocking Admission of Low Priority Users

We analyse a cell of Cognitive Radio Network ( $CRN$ ) as the multiline queueing system supplying service to two Markovian arrival flows users. Primary (or licensed) users called High Priority Users notation="LaTeX">$HPU\text{s}$ have preemptive priority over secondary (cognitive) Low notation="LaTeX">$LPU\text{s}$ ). The are dropped upon only if all servers occupied by . If at epoch busy but some them provide , one notation="LaTeX">$LPU$ is immediately interrupted and notation="LaTeX">$HPU$ begins in released server. A accepted number less than defined advance threshold notation="LaTeX">$M$ Otherwise, permanently lost or becomes retrial user. user repeats attempts receive later after random time intervals. whose either transferred virtual place orbit. placed orbit may be impatient can renege system. follows an exponential probability distribution with rate determined user’s type. After loss admission blocked. informed that their access temporarily suspended do not generate new requests until blocking expires. purpose research optimization period duration. Behavior described multidimensional continuous-time Markov chain. Its generator, ergodicity condition invariant derived. Expressions for performance indicators given. Numerical results demonstrating usefulness significance account correlation arrivals presented. E.g., presented example cost criterion gives 18 percent profit comparing without blocking.